Vertex-dominating cycles in 2-connected bipartite graphs
نویسنده
چکیده
A cycle C is a vertex-dominating cycle if every vertex is adjacent to some vertex of C. Bondy and Fan [4] showed that if G is a 2-connected graph with δ(G) ≥ 13 (|V (G)| − 4), then G has a vertex-dominating cycle. In this paper, we prove that if G is a 2-connected bipartite graph with partite sets V1 and V2 such that δ(G) ≥ 1 3 (max{|V1|, |V2|}+ 1), then G has a vertex-dominating cycle.
منابع مشابه
Strength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملLong Cycles in 2-Connected Triangle-Free Graphs
Dirac showed that a 2–connected graph of order n with minimum degree δ has circumference at least min{2δ, n}. We prove that a 2– connected, triangle-free graph G of order n with minimum degree δ either has circumference at least min{4δ−4, n}, or every longest cycle in G is dominating. This result is best possible in the sense that there exist bipartite graphs with minimum degree δ whose longest...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 27 شماره
صفحات -
تاریخ انتشار 2007